#include "..\CookHeader.h"

typedef  Array <Array <int>> Graph;
Graph initGraph(int size) {
	Graph G;
	Array <int> tmpAry;
	for (int i = 0; i < size; i++) {
		tmpAry.clear();
		for (int k = 0; k < size; k++)
			tmpAry.push_back(0);
		G.push_back(tmpAry);
	}
	return G;
}

Graph G1;
int gSize = 6;
Array <string> nameAry = { "õ", "", "", "", "", "λ" };
int õ = 0,  = 1,  = 2,  = 3,  = 4, λ = 5;

void printGraph(Graph g) {  //  pringGraph()    Ϻ 
	print("    ");
	for (int v = 0; v < len(g); v++)
		print(nameAry[v]+" "); //  ĭ 
	println("");
	for (int row = 0; row < len(g); row++) {
		print(nameAry[row]+"  ");
		for (int col = 0; col < len(g[row]); col++) {
			if (g[row][col] == 0) // 0 ĭ 
				print(" 0");
			else 
				print(g[row][col]);
			print("  ");
		}
		println("");
	}
	println("");
}

bool findVertex(Graph g, int findVtx) {
	Array <int> stack;
	Array <int> visitedAry;

	int current = 0;  //  
	stack.push_back(current);
	visitedAry.push_back(current);

	while (len(stack) != 0) {
		int next = -1;
		for (int vertex = 0; vertex < gSize; vertex++) {
			if (g[current][vertex] != 0) {
				if (isInArray(visitedAry, vertex)) // 湮  ִ ̸ Ż
				{
				}
				else { // 湮     
					next = vertex;
					break;
				}
			}
		}
		if (next != -1) {    //  湮  ִ 
			current = next;
			stack.push_back(current);
			visitedAry.push_back(current);
		}
		else {                //  湮   
			current = stack[len(stack) - 1];
			stack.pop_back();
		}
	}

	if (isInArray(visitedAry, findVtx))
		return true;
	else
		return false;
}

int main() {
	G1 = initGraph(gSize);
	G1[õ][] = 10; G1[õ][] = 15;
	G1[][õ] = 10; G1[][] = 40; G1[][] = 11; G1[][] = 50;
	G1[][õ] = 15; G1[][] = 40; G1[][] = 12;
	G1[][] = 11; G1[][] = 12; G1[][] = 20; G1[][λ] = 30;
	G1[][] = 50; G1[][] = 20; G1[][λ] = 25;
	G1[λ][] = 30; G1[λ][] = 25;

	println("##   Ǽ  ü ᵵ ##\n");
	printGraph(G1);

	Array <Array <int>> edgeAry;
	for (int i = 0; i < gSize; i++) {
		for (int k = 0; k < gSize; k++) {
			if (G1[i][k] != 0)
				edgeAry.push_back({ G1[i][k], i, k });
		}
	}
	
	sortArray(edgeAry);		 // 
	reverseArray(edgeAry);   // 

	Array <Array <int>> newAry;
	for (int i = 0; i < len(edgeAry); i += 2)
		newAry.push_back(edgeAry[i]);

	int index = 0;
	int start, end, saveCost;
	bool startYN, endYN;
	while (len(newAry) > gSize - 1) {
		start = newAry[index][1];
		end = newAry[index][2];
		saveCost = newAry[index][0];

		G1[start][end] = 0;
		G1[end][start] = 0;

		startYN = findVertex(G1, start);
		endYN = findVertex(G1, end);

		if (startYN && endYN) 
			del(newAry, index); // index ġ  
		else {
			G1[start][end] = saveCost;
			G1[end][start] = saveCost;
			index++;
		}
	}
	println("## ּ    ᵵ ##\n");
	printGraph(G1);
}